Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
+(x, +(y, z)) → +(+(x, y), z)
f(g(f(x))) → f(h(s(0), x))
f(g(h(x, y))) → f(h(s(x), y))
f(h(x, h(y, z))) → f(h(+(x, y), z))
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Quasi-Precedence:
g1 > 0
g1 > h2 > +2 > s1
Status: +2: [2,1]
h2: [2,1]